According to different storage methods of child suffix tree , we introduce several searching technology 根據不同的子后綴樹存儲方法,本文介紹了多種搜索方法。
This index is based on suffix tree , and is divided into some layers . a layer usually includes some child suffix trees 分層索引結構是基于后綴樹的,它由若干層組成,通常情況下,每一層又包括若干棵子后綴樹。
The construction algorithm embodies three parts that are suffix sorting , logest common prefix evaluation process and child suffix tree construction 整個建立算法包括三個部分:后綴排序,計算最短公共前綴和建立子后綴樹。
The second part includes the index of child suffix tree , and some other information for finding the location of every child suffix tree in disk quickly 第二部分是索引部分,包括子后綴樹的索引和其他信息。利用這部分信息,可以快速定位每棵子后綴樹在磁盤中的位置。
The storage of index is divided into two parts . the first part is the information of each child suffix tree . child suffix tree can be represented by several methods which require different storage space 在存儲策略上,本文把整個索引劃分為兩部分:第一部分保存子后綴樹的信息,子后綴樹可以采用多種不同的優(yōu)化方法存儲,每種方法所需的存儲空間和性能均不相同。